On classes of convolutional codes that are not asymptotically catastrophic

نویسنده

  • Kjell Jørgen Hole
چکیده

Denote by w 0 the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assume that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w 0 approaches zero for large m. In this paper we prove the existence of convolutional code classes that are not asymptotically catastrophic by providing explicit constructions of codes with nonzero w 0 for all m.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE

This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...

متن کامل

Learning Document Image Features With SqueezeNet Convolutional Neural Network

The classification of various document images is considered an important step towards building a modern digital library or office automation system. Convolutional Neural Network (CNN) classifiers trained with backpropagation are considered to be the current state of the art model for this task. However, there are two major drawbacks for these classifiers: the huge computational power demand for...

متن کامل

Asymptotically Good Convolutional Codes

In this paper, we construct new sequences of asymptotically good convolutional codes (AGCC). These sequences are obtained from sequences of transitive, self-orthogonal and self-dual algebraic geometry (AG) codes attaining the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the 〈u|u+ v〉 construction and the product code constru...

متن کامل

Convolutional Codes Over Rings

Elementary information about convolutional codes over finite fields is introduced, and various motivations for extension to convolutional codes over finite rings are discussed. The recent primary motivation is found to be for use over phase modulation signals. Such ring codes enjoy the special property of phase weight equal to phase distance equal to the squared Euclidean distance between phase...

متن کامل

Quasi-cyclic unit memory convolutional codes

Unit memory convolutional codes with generator matrices, which are composed of circulant suhmatrices, are introduced. This structure facilitates the analysis as well as an efficient search for good codes. Equivalences among such codes and consider some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes tre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2000